Algorithms determining finite simple images of finitely presented groups
نویسندگان
چکیده
منابع مشابه
Finitely generated nilpotent groups are finitely presented and residually finite
Definition 1. Let G be a group. G is said to be residually finite if the intersection of all normal subgroups of G of finite index in G is trivial. For a survey of results on residual finiteness and related properties, see Mag-nus, Karrass, and Solitar [6, Section 6.5]. We shall present a proof of the following well known theorem, which is important for Kharlampovich [4, 5]. See also O. V. Bele...
متن کاملFinitely Presented Residually Free Groups
We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all n ∈ N, a residually free group is of type FPn if and only if it is of type Fn. New families of subdirect products of free groups are constructed, including the first examples of finitely presented subgroups ...
متن کاملAlgorithms for Finite, Finitely Presented and Free Lattices
In this talk we will present and analyze the efficiency of various algorithms in lattice theory. For finite lattices this will include recognition of various properties such as subdirect irreducibility, semidistributivity, and boundedness (in the sense of McKenzie) as well as efficient algorithms for computing the congruence lattice. For free and finitely presented lattices we will discuss algo...
متن کاملConstructing Matrix Representations of Finitely Presented Groups
The Todd-Coxeter coset enumeration algorithm is one of the most powerful tools of computational group theory. It may be viewed as a means of constructing permutation representations of nitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix representations over many elds. In fact the algorithm is more general than this, and can be used to constr...
متن کاملDecompositions of finitely generated and finitely presented groups
In this paper we discuss the splitting or decomposing of finitely generated groups into free products, free products with amalgamation or HNN extensions and we discuss the JSJ decomposition of finitely presented groups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inventiones mathematicae
سال: 2019
ISSN: 0020-9910,1432-1297
DOI: 10.1007/s00222-019-00892-3